Deep Attention-guided Graph Clustering with Dual Self-supervision

نویسندگان

چکیده

Existing deep embedding clustering methods fail to sufficiently utilize the available off-the-shelf information from feature embeddings and cluster assignments, limiting their performance. To this end, we propose a novel method, namely attention-guided graph with dual self-supervision (DAGC). Specifically, DAGC first utilizes heterogeneity-wise fusion module adaptively integrate features of auto-encoder convolutional network in each layer then uses scale-wise dynamically concatenate multi-scale different layers. Such modules are capable learning an informative via attention-based mechanism. In addition, design distribution-wise that leverages assignments acquire results directly. better explore develop solution consisting soft strategy Kullback-Leibler divergence loss hard pseudo supervision loss. Extensive experiments on nine benchmark datasets validate our method consistently outperforms state-of-the-art methods. Especially, improves ARI by more than 10.29% over best baseline. The code will be publicly at https://github.com/ZhihaoPENG-CityU/DAGC.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Document Clustering with Dual Supervision

Nowadays, academic researchers maintain a personal library of papers, which they would like to organize based on their needs, e.g., research, projects, or courseware. Clustering techniques are often employed to achieve this goal by grouping the document collection into different topics. Unsupervised clustering does not require any user effort but only produces one universal output with which us...

متن کامل

Regularized Co-Clustering with Dual Supervision

By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive performance improvements over traditional one-sided row clustering techniques. A good clustering of features may be seen as a combinatorial transformation of the data matrix, effectively enforcing a form of regularization ...

متن کامل

Deep Graph Attention Model

Graph classification is a problem with practical applications in many different domains. Most of the existing methods take the entire graph into account when calculating graph features. In a graphlet-based approach, for instance, the entire graph is processed to get the total count of different graphlets or subgraphs. In the real-world, however, graphs can be both large and noisy with discrimin...

متن کامل

Attention Guided Deep Imitation Learning

When a learning agent attempts to imitate human visuomotor behaviors, it may benefit from knowing the human demonstrator’s visual attention. Such information could clarify the goal of the demonstrator, i.e., the object being attended is the most likely target of the current action. Hence it could help the agent better infer and learn the demonstrator’s underlying state representation for decisi...

متن کامل

Self-representation based dual-graph regularized feature selection clustering

Feature selection algorithms eliminate irrelevant and redundant features, even the noise, while preserving the most representative features. They can reduce the dimension of the dataset, extract essential features in high dimensional data and improve learning quality. Existing feature selection algorithms are all carried out in data space. However, the information of feature space cannot be ful...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems for Video Technology

سال: 2022

ISSN: ['1051-8215', '1558-2205']

DOI: https://doi.org/10.1109/tcsvt.2022.3232604